#include <stdio.h>
#include <string.h>
#include "sort.h"
int main() {

	type_t input[8] = {'8', '5', '1', '9', '0', '4', '6', '3'};
	type_t tmp[8] = {0};
	
	memcpy(tmp, input, sizeof(type_t) * 8);
	sort_bubble(tmp, 8);
	sort_print(tmp, 8, "bubble sorting algorithm");
	

	memcpy(tmp, input, sizeof(type_t) * 8);
	sort_quick(tmp, 8);
	sort_print(tmp, 8, "quick sorting algorithm");

	memcpy(tmp, input, sizeof(type_t) * 8);
	sort_quick(tmp, 8);
	sort_print(tmp, 8, "insertion algorithm");

	memcpy(tmp, input, sizeof(type_t) * 8);
	sort_merge(tmp, 8);
	sort_print(tmp, 8, "merge algorithm");

	memcpy(tmp, input, sizeof(type_t) * 8);
	sort_heap(tmp, 8);
	sort_print(tmp, 8, "heap sort algorithm");

	memcpy(tmp, input, sizeof(type_t) * 8);
	sort_selection(tmp, 8);
	sort_print(tmp, 8, "selection sort algorithm");

	memcpy(tmp, input, sizeof(type_t) * 8);
	sort_counting(tmp, 8);
	sort_print(tmp, 8, "counting sort algorithm");

	return 0;
}
